On divisibility graph for simple Zassenhaus groups

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides $a$. In this paper we will find $D(G)$ where $G$ is a simple Zassenhaus group

Divisibility graph for symmetric and alternating groups

Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides $a$. Let $X=cs~{G}$ be the set of conjugacy class sizes of a group $G$. In this case, we denote $D(cs~{G})$ by $D(G)$. In this paper we will find the number of connected components of $D(G)$ where $G$ is the symmetric group $S_n$ or is the alternating group $A_n$

The Divisibility Graph of finite groups of Lie Type

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the Divisibility Graph of the finite groups of Lie type in odd characteristic

Quotient graphs for power graphs

In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph $\mathcal{P}_0(G)$ of a finite group $G$, finding a formula for the number $c(\mathcal{P}_0(G))$ of its components which is particularly illuminative when $G\leq S_n$ is a fusion controlled permutation group. We make use of the proper quotient power graph $\widetilde{\mathcal{P}}_0(G)$, the proper order graph $\mathcal{O}_0(G)$ and the proper type graph $\mathcal{T}_0(G)$. We show that all those graphs are quotient of $\mathcal{P}_0(G)$ and demonstrate a strong link between them dealing with $G=S_n$. We find simultaneously $c(\mathcal{P}_0(S_n))$ as well as the number of components of $\widetilde{\mathcal{P}}_0(S_n)$, $\mathcal{O}_0(S_n)$ and $\mathcal{T}_0(S_n)$

ON SOME EQUIVALENCE RELATION ON NON-ABELIAN \CA-GROUPS

A non-abelian group $G$ is called a \CA-group (\CC-group) if $C_G(x)$ is abelian(cyclic) for all $x\in G\setminus Z(G)$. We say $x\sim y$ if and only if $C_G(x)=C_G(y)$.We denote the equivalence class including $x$ by$[x]_{\sim}$. In this paper, we prove thatif $G$ is a \CA-group and $[x]_{\sim}=xZ(G)$, for all $x\in G$, then $2^{r-1}\leq|G'|\leq 2^{r\choose 2}$.where $\frac {|G|}{|Z(G)|}=2^{r}, 2\leq r$ and characterize all groups whose $[x]_{\sim}=xZ(G)$for all $x\in G$ and $|G|\leq 100$. Also, we will show that if $G$ is a \CC-group and $[x]_{\sim}=xZ(G)$,for all $x \in G$, then $G\cong C_m\times Q_8$ where $C_m$ is a cyclic group of odd order $m$ andif $G$ is a \CC-group and $[x]_{\sim}=x^G$, for all $x\in G\setminus Z(G)$, then $G\cong Q_8$

Domination parameters and diameter of Abelian Cayley graphs

Using the domination parameters of Cayley graphs constructed out of $\mathbb{Z}_{p}\times \mathbb{Z}_{m}$, where $m\in\{p^{\alpha}, p^{\alpha}q^{\beta}, p^{\alpha}q^{\beta}r^{\gamma}\},$ in this paper we are discussing about the total and connected domination number and diameter of these Cayley graphs